A heuristic path planning method for robot working in an indoor environment

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact and heuristic path planning methods for a virtual environment

Path planning belongs to the best-known and well explored problems in computer science. However, in today’s real-time and dynamic applications, such as virtual reality, existing algorithms for static environment are considerably insufficient and, surprisingly, almost no attention is given to techniques for dynamic graphs. This paper introduces two methods to plan a path in an undirected graph w...

متن کامل

Block Iterative Method for Robot Path Planning

Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. This paper conducts an experiment to speed up the computation by solving the harmonic functions with faster solver, i.e. two-point Explicit Group (EG) ite...

متن کامل

A New Hybrid Method for Mobile Robot Dynamic Local Path Planning in Unknown Environment

In this paper, a hybrid approach for efficiently planning smooth local paths for mobile robot in an unknown environment is presented. The single robot is treated as a multi-agent system, and the corresponding architecture with cooperative control is constructed. And then a new method of information fusion namely DSmT (Dezert-Smarandache Theory) which is an extension of the DST (Dempster-Shafer ...

متن کامل

Evolutionary Approach for Mobile Robot Path Planning in Complex environment

The shortest/optimal path planning in a static environment is essential for the efficient operation of a mobile robot. Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. In this paper, the problem of finding the optimal collision free path in complex environments f...

متن کامل

Optimal Path Selection for Mobile Robot Navigation Using Genetic Algorithm in an Indoor Environment

The proposed Navigation Strategy using GA(Genetic Algorithm) f inds a n optimal p ath in the simulated grid environment. GA forces to find a path that is connected to the robot start and target positions via predefined points. Each point in the environmental model is called genome and the path connecting Start and Target is called as Chromosome. According to the problem formulation, the length ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Korea institute of electronic communication sciences

سال: 2014

ISSN: 1975-8170

DOI: 10.13067/jkiecs.2014.9.8.907